0.12/0.13 % Problem : SLH379^1 : TPTP v7.5.0. Released v7.5.0. 0.12/0.14 % Command : run_E %s %d THM 0.14/0.35 % Computer : n014.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 30 0.14/0.35 % WCLimit : 30 0.14/0.35 % DateTime : Tue Aug 9 02:54:31 EDT 2022 0.14/0.35 % CPUTime : 0.20/0.48 The problem SPC is TH0_THM_EQU_NAR 0.20/0.48 Running higher-order on 1 cores theorem proving 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.49 # Version: 3.0pre003-ho 1.04/1.25 # Preprocessing class: HSLSSMSSSSSNHSA. 1.04/1.25 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.04/1.25 # Starting full_lambda_9 with 30s (1) cores 1.04/1.25 # full_lambda_9 with pid 11043 completed with status 0 1.04/1.25 # Result found by full_lambda_9 1.04/1.25 # Preprocessing class: HSLSSMSSSSSNHSA. 1.04/1.25 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.04/1.25 # Starting full_lambda_9 with 30s (1) cores 1.04/1.25 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 1.04/1.25 # ...ProofStateSinE()=231/252 1.04/1.25 # Search class: HGHSM-FSLM32-DHSFFFBN 1.04/1.25 # partial match(1): HGHSM-FSLM32-DHSFFSBN 1.04/1.25 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 1.04/1.25 # Starting full_lambda_3 with 14s (1) cores 1.04/1.25 # full_lambda_3 with pid 11044 completed with status 0 1.04/1.25 # Result found by full_lambda_3 1.04/1.25 # Preprocessing class: HSLSSMSSSSSNHSA. 1.04/1.25 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.04/1.25 # Starting full_lambda_9 with 30s (1) cores 1.04/1.25 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 1.04/1.25 # ...ProofStateSinE()=231/252 1.04/1.25 # Search class: HGHSM-FSLM32-DHSFFFBN 1.04/1.25 # partial match(1): HGHSM-FSLM32-DHSFFSBN 1.04/1.25 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 1.04/1.25 # Starting full_lambda_3 with 14s (1) cores 1.04/1.25 # Preprocessing time : 0.008 s 1.04/1.25 1.04/1.25 # Proof found! 1.04/1.25 # SZS status Theorem 1.04/1.25 # SZS output start CNFRefutation 1.04/1.25 thf(decl_22, type, fun_upd_nat_a: (nat > a) > nat > a > nat > a). 1.04/1.25 thf(decl_23, type, minus_minus_nat: nat > nat > nat). 1.04/1.25 thf(decl_24, type, map2_a_a_a: (a > a > a) > list_a > list_a > list_a). 1.04/1.25 thf(decl_25, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a). 1.04/1.25 thf(decl_26, type, listIn1417627087drop_a: nat > (nat > a) > nat > a). 1.04/1.25 thf(decl_27, type, listIn84854903take_a: nat > (nat > a) > list_a). 1.04/1.25 thf(decl_28, type, append_a: list_a > list_a > list_a). 1.04/1.25 thf(decl_29, type, drop_a: nat > list_a > list_a). 1.04/1.25 thf(decl_30, type, nil_a: list_a). 1.04/1.25 thf(decl_31, type, take_a: nat > list_a > list_a). 1.04/1.25 thf(decl_32, type, size_size_list_a: list_a > nat). 1.04/1.25 thf(decl_33, type, ord_less_nat: nat > nat > $o). 1.04/1.25 thf(decl_34, type, ord_less_eq_nat: nat > nat > $o). 1.04/1.25 thf(decl_35, type, f: nat > a). 1.04/1.25 thf(decl_36, type, g: nat > a). 1.04/1.25 thf(decl_37, type, xs: list_a). 1.04/1.25 thf(decl_38, type, ys: list_a). 1.04/1.25 thf(decl_39, type, esk1_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_40, type, esk2_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_41, type, esk3_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_42, type, esk4_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_43, type, esk5_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_44, type, esk6_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_45, type, esk7_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_46, type, esk8_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_47, type, esk9_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_48, type, esk10_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_49, type, esk11_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_50, type, esk12_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_51, type, esk13_2: (nat > $o) > nat > nat). 1.04/1.25 thf(decl_52, type, esk14_1: (nat > $o) > nat). 1.04/1.25 thf(decl_53, type, esk15_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_54, type, esk16_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_55, type, esk17_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_56, type, esk18_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_57, type, esk19_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_58, type, esk20_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_59, type, esk21_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_60, type, esk22_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_61, type, esk23_1: (nat > nat) > nat). 1.04/1.25 thf(decl_62, type, esk24_1: (nat > nat) > nat). 1.04/1.25 thf(decl_63, type, esk25_1: nat > list_a). 1.04/1.25 thf(decl_64, type, esk26_4: list_a > (nat > a) > list_a > (nat > a) > list_a). 1.04/1.25 thf(decl_65, type, esk27_1: (list_a > $o) > list_a). 1.04/1.25 thf(decl_66, type, esk28_4: list_a > (nat > a) > list_a > (nat > a) > list_a). 1.04/1.25 thf(decl_67, type, esk29_4: list_a > (nat > a) > list_a > (nat > a) > list_a). 1.04/1.25 thf(decl_68, type, esk30_2: list_a > list_a > nat). 1.04/1.25 thf(decl_69, type, esk31_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_70, type, esk32_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_71, type, esk33_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_72, type, esk34_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_73, type, esk35_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_74, type, esk36_4: nat > (nat > nat) > nat > nat > nat). 1.04/1.25 thf(decl_75, type, esk37_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_76, type, esk38_4: nat > nat > (nat > nat) > nat > nat). 1.04/1.25 thf(decl_77, type, esk39_1: nat > nat). 1.04/1.25 thf(decl_78, type, esk40_1: (nat > $o) > nat). 1.04/1.25 thf(decl_79, type, esk41_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_80, type, esk42_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_81, type, esk43_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_82, type, esk44_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_83, type, esk45_1: (nat > nat > $o) > nat). 1.04/1.25 thf(decl_84, type, esk46_1: (nat > $o) > nat). 1.04/1.25 thf(decl_85, type, esk47_1: (nat > $o) > nat). 1.04/1.25 thf(decl_86, type, esk48_4: list_a > list_a > list_a > list_a > list_a). 1.04/1.25 thf(decl_87, type, esk49_4: list_a > list_a > list_a > list_a > list_a). 1.04/1.25 thf(decl_88, type, esk50_0: nat). 1.04/1.25 thf(decl_89, type, esk51_0: nat). 1.04/1.25 thf(decl_90, type, esk52_3: list_a > (nat > a) > (nat > a) > nat). 1.04/1.25 thf(decl_91, type, esk53_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_92, type, esk54_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_93, type, esk55_3: nat > (nat > a) > (nat > a) > nat). 1.04/1.25 thf(decl_94, type, esk56_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_95, type, esk57_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_96, type, esk58_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_97, type, esk59_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_98, type, esk60_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_99, type, esk61_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.25 thf(decl_100, type, esk62_0: nat). 1.04/1.25 thf(decl_101, type, esk63_0: nat). 1.04/1.25 thf(decl_102, type, esk64_0: nat). 1.04/1.25 thf(decl_103, type, esk65_0: nat). 1.04/1.25 thf(decl_104, type, esk66_0: nat). 1.04/1.25 thf(decl_105, type, esk67_0: nat). 1.04/1.25 thf(decl_106, type, esk68_0: nat). 1.04/1.26 thf(decl_107, type, esk69_0: nat). 1.04/1.26 thf(decl_108, type, esk70_0: nat). 1.04/1.26 thf(decl_109, type, esk71_0: nat). 1.04/1.26 thf(decl_110, type, esk72_0: nat). 1.04/1.26 thf(decl_111, type, esk73_0: nat). 1.04/1.26 thf(decl_112, type, esk74_0: nat). 1.04/1.26 thf(decl_113, type, esk75_0: nat). 1.04/1.26 thf(decl_114, type, esk76_0: nat). 1.04/1.26 thf(decl_115, type, esk77_0: nat). 1.04/1.26 thf(decl_116, type, esk78_0: nat). 1.04/1.26 thf(decl_117, type, esk79_0: nat). 1.04/1.26 thf(decl_118, type, esk80_1: (nat > a) > nat). 1.04/1.26 thf(decl_119, type, esk81_0: nat). 1.04/1.26 thf(decl_120, type, esk82_0: nat). 1.04/1.26 thf(decl_121, type, esk83_3: list_a > (nat > a) > (nat > a) > nat). 1.04/1.26 thf(decl_122, type, esk84_0: nat). 1.04/1.26 thf(decl_123, type, esk85_0: nat). 1.04/1.26 thf(decl_124, type, esk86_0: nat). 1.04/1.26 thf(decl_125, type, esk87_1: (nat > a) > nat). 1.04/1.26 thf(decl_126, type, esk88_0: nat). 1.04/1.26 thf(decl_127, type, esk89_0: nat). 1.04/1.26 thf(decl_128, type, esk90_0: nat). 1.04/1.26 thf(decl_129, type, esk91_0: nat). 1.04/1.26 thf(decl_130, type, esk92_0: nat). 1.04/1.26 thf(decl_131, type, esk93_0: nat). 1.04/1.26 thf(decl_132, type, esk94_0: nat). 1.04/1.26 thf(decl_133, type, esk95_0: nat). 1.04/1.26 thf(decl_134, type, esk96_1: list_a > nat). 1.04/1.26 thf(decl_135, type, esk97_0: nat). 1.04/1.26 thf(decl_136, type, esk98_0: nat). 1.04/1.26 thf(decl_137, type, esk99_0: nat). 1.04/1.26 thf(decl_138, type, esk100_0: nat). 1.04/1.26 thf(decl_139, type, esk101_0: nat). 1.04/1.26 thf(decl_140, type, esk102_0: nat). 1.04/1.26 thf(decl_141, type, esk103_0: nat). 1.04/1.26 thf(decl_142, type, esk104_1: (nat > a) > nat). 1.04/1.26 thf(decl_143, type, esk105_0: nat). 1.04/1.26 thf(decl_144, type, esk106_0: nat). 1.04/1.26 thf(decl_145, type, esk107_0: nat). 1.04/1.26 thf(decl_146, type, esk108_0: nat). 1.04/1.26 thf(decl_147, type, esk109_0: nat). 1.04/1.26 thf(decl_148, type, esk110_0: nat). 1.04/1.26 thf(decl_149, type, esk111_0: nat). 1.04/1.26 thf(decl_150, type, esk112_0: nat). 1.04/1.26 thf(decl_151, type, esk113_0: nat). 1.04/1.26 thf(decl_152, type, esk114_0: nat). 1.04/1.26 thf(decl_153, type, esk115_0: nat). 1.04/1.26 thf(decl_154, type, esk116_0: nat). 1.04/1.26 thf(decl_155, type, esk117_0: nat). 1.04/1.26 thf(decl_156, type, esk118_0: nat). 1.04/1.26 thf(decl_157, type, esk119_0: nat). 1.04/1.26 thf(decl_158, type, esk120_0: nat). 1.04/1.26 thf(decl_159, type, esk121_0: nat). 1.04/1.26 thf(decl_160, type, esk122_0: nat). 1.04/1.26 thf(decl_161, type, esk123_0: nat). 1.04/1.26 thf(decl_162, type, esk124_0: nat). 1.04/1.26 thf(decl_163, type, esk125_0: nat). 1.04/1.26 thf(decl_164, type, esk126_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_165, type, esk127_0: nat). 1.04/1.26 thf(decl_166, type, esk128_0: nat). 1.04/1.26 thf(decl_167, type, esk129_2: list_a > (nat > a) > nat). 1.04/1.26 thf(decl_168, type, esk130_2: list_a > (nat > a) > nat). 1.04/1.26 thf(decl_169, type, esk131_2: list_a > (nat > a) > nat). 1.04/1.26 thf(decl_170, type, esk132_1: (nat > a) > nat). 1.04/1.26 thf(decl_171, type, esk133_2: list_a > (nat > a) > nat). 1.04/1.26 thf(decl_172, type, esk134_0: nat). 1.04/1.26 thf(decl_173, type, esk135_0: nat). 1.04/1.26 thf(decl_174, type, esk136_0: nat). 1.04/1.26 thf(decl_175, type, esk137_0: nat). 1.04/1.26 thf(decl_176, type, esk138_0: nat). 1.04/1.26 thf(decl_177, type, esk139_0: nat). 1.04/1.26 thf(decl_178, type, esk140_0: nat). 1.04/1.26 thf(decl_179, type, esk141_0: nat). 1.04/1.26 thf(decl_180, type, esk142_0: nat). 1.04/1.26 thf(decl_181, type, esk143_0: nat). 1.04/1.26 thf(decl_182, type, esk144_0: nat). 1.04/1.26 thf(decl_183, type, esk145_0: nat). 1.04/1.26 thf(decl_184, type, esk146_0: nat). 1.04/1.26 thf(decl_185, type, esk147_0: nat). 1.04/1.26 thf(decl_186, type, esk148_0: nat). 1.04/1.26 thf(decl_187, type, esk149_0: nat). 1.04/1.26 thf(decl_188, type, esk150_0: nat). 1.04/1.26 thf(decl_189, type, esk151_0: nat). 1.04/1.26 thf(decl_190, type, esk152_0: nat). 1.04/1.26 thf(decl_191, type, esk153_0: nat). 1.04/1.26 thf(decl_192, type, esk154_0: nat). 1.04/1.26 thf(decl_193, type, esk155_0: nat). 1.04/1.26 thf(decl_194, type, esk156_0: nat). 1.04/1.26 thf(decl_195, type, esk157_0: nat). 1.04/1.26 thf(decl_196, type, esk158_0: nat). 1.04/1.26 thf(decl_197, type, esk159_0: nat). 1.04/1.26 thf(decl_198, type, esk160_0: nat). 1.04/1.26 thf(decl_199, type, esk161_4: list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_200, type, esk162_5: list_a > list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_201, type, esk163_5: list_a > list_a > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_202, type, esk164_1: (nat > a) > nat). 1.04/1.26 thf(decl_203, type, esk165_0: nat). 1.04/1.26 thf(decl_204, type, esk166_0: nat). 1.04/1.26 thf(decl_205, type, esk167_0: nat). 1.04/1.26 thf(decl_206, type, esk168_0: nat). 1.04/1.26 thf(decl_207, type, esk169_0: nat). 1.04/1.26 thf(decl_208, type, esk170_0: nat). 1.04/1.26 thf(decl_209, type, esk171_0: nat). 1.04/1.26 thf(decl_210, type, esk172_0: nat). 1.04/1.26 thf(decl_211, type, esk173_0: nat). 1.04/1.26 thf(decl_212, type, esk174_0: nat). 1.04/1.26 thf(decl_213, type, esk175_0: nat). 1.04/1.26 thf(decl_214, type, esk176_0: nat). 1.04/1.26 thf(decl_215, type, esk177_0: nat). 1.04/1.26 thf(decl_216, type, esk178_0: nat). 1.04/1.26 thf(decl_217, type, esk179_0: nat). 1.04/1.26 thf(decl_218, type, esk180_0: nat). 1.04/1.26 thf(decl_219, type, esk181_0: nat). 1.04/1.26 thf(decl_220, type, esk182_0: nat). 1.04/1.26 thf(decl_221, type, esk183_1: (nat > a) > nat). 1.04/1.26 thf(decl_222, type, esk184_3: (nat > a) > (nat > a) > nat > nat). 1.04/1.26 thf(decl_223, type, esk185_1: (nat > a) > nat). 1.04/1.26 thf(decl_224, type, esk186_1: (nat > a) > nat). 1.04/1.26 thf(decl_225, type, esk187_1: (nat > a) > nat). 1.04/1.26 thf(decl_226, type, esk188_0: nat). 1.04/1.26 thf(decl_227, type, esk189_0: nat). 1.04/1.26 thf(decl_228, type, esk190_0: nat). 1.04/1.26 thf(decl_229, type, esk191_0: nat). 1.04/1.26 thf(decl_230, type, esk192_0: nat). 1.04/1.26 thf(decl_231, type, esk193_1: (nat > a) > nat). 1.04/1.26 thf(decl_232, type, esk194_1: (nat > a) > nat). 1.04/1.26 thf(decl_233, type, esk195_0: nat). 1.04/1.26 thf(decl_234, type, esk196_0: nat). 1.04/1.26 thf(decl_235, type, esk197_0: nat). 1.04/1.26 thf(decl_236, type, esk198_0: nat). 1.04/1.26 thf(decl_237, type, esk199_1: (nat > a) > nat). 1.04/1.26 thf(decl_238, type, esk200_1: (nat > a) > nat). 1.04/1.26 thf(decl_239, type, esk201_0: nat). 1.04/1.26 thf(decl_240, type, esk202_0: nat). 1.04/1.26 thf(decl_241, type, esk203_0: nat). 1.04/1.26 thf(decl_242, type, esk204_0: nat). 1.04/1.26 thf(decl_243, type, esk205_0: nat). 1.04/1.26 thf(decl_244, type, esk206_0: nat). 1.04/1.26 thf(decl_245, type, esk207_0: nat). 1.04/1.26 thf(decl_246, type, esk208_0: nat). 1.04/1.26 thf(decl_247, type, esk209_1: (nat > a) > nat). 1.04/1.26 thf(decl_248, type, esk210_1: (nat > a) > nat). 1.04/1.26 thf(decl_249, type, esk211_1: (nat > a) > nat). 1.04/1.26 thf(decl_250, type, esk212_0: nat). 1.04/1.26 thf(decl_251, type, esk213_1: (nat > a) > nat). 1.04/1.26 thf(decl_252, type, esk214_0: nat). 1.04/1.26 thf(decl_253, type, esk215_3: nat > (nat > a) > (nat > a) > nat). 1.04/1.26 thf(decl_254, type, esk216_4: nat > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_255, type, esk217_4: nat > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_256, type, esk218_0: nat). 1.04/1.26 thf(decl_257, type, esk219_0: nat). 1.04/1.26 thf(decl_258, type, esk220_0: nat). 1.04/1.26 thf(decl_259, type, esk221_0: nat). 1.04/1.26 thf(decl_260, type, esk222_0: nat). 1.04/1.26 thf(decl_261, type, esk223_2: (nat > a) > (nat > a) > nat). 1.04/1.26 thf(decl_262, type, esk224_1: (nat > a) > nat). 1.04/1.26 thf(decl_263, type, esk225_0: nat). 1.04/1.26 thf(decl_264, type, esk226_0: nat). 1.04/1.26 thf(decl_265, type, esk227_0: nat). 1.04/1.26 thf(decl_266, type, esk228_0: nat). 1.04/1.26 thf(decl_267, type, esk229_4: nat > nat > (nat > a) > (nat > a) > nat). 1.04/1.26 thf(decl_268, type, esk230_1: nat > nat). 1.04/1.26 thf(decl_269, type, esk231_0: nat). 1.04/1.26 thf(decl_270, type, esk232_0: nat). 1.04/1.26 thf(decl_271, type, esk233_4: nat > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_272, type, esk234_4: nat > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(decl_273, type, esk235_4: nat > (nat > a) > (nat > a) > list_a > nat). 1.04/1.26 thf(fact_96_append__eq__conv__conj, axiom, ![X1:list_a, X4:list_a, X56:list_a]:((((append_a @ X1 @ X4)=(X56))<=>(((X1)=(take_a @ (size_size_list_a @ X1) @ X56))&((X4)=(drop_a @ (size_size_list_a @ X1) @ X56))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_96_append__eq__conv__conj)). 1.04/1.26 thf(fact_98_append__eq__append__conv__if, axiom, ![X68:list_a, X69:list_a, X70:list_a, X71:list_a]:((((append_a @ X68 @ X69)=(append_a @ X70 @ X71))<=>(((ord_less_eq_nat @ (size_size_list_a @ X68) @ (size_size_list_a @ X70))=>(((X68)=(take_a @ (size_size_list_a @ X68) @ X70))&((X69)=(append_a @ (drop_a @ (size_size_list_a @ X68) @ X70) @ X71))))&(~((ord_less_eq_nat @ (size_size_list_a @ X68) @ (size_size_list_a @ X70)))=>(((take_a @ (size_size_list_a @ X70) @ X68)=(X70))&((append_a @ (drop_a @ (size_size_list_a @ X70) @ X68) @ X69)=(X71))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_98_append__eq__append__conv__if)). 1.04/1.26 thf(fact_105_append__Nil2, axiom, ![X1:list_a]:(((append_a @ X1 @ nil_a)=(X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_105_append__Nil2)). 1.04/1.26 thf(conj_1, conjecture, (((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g))<=>(((xs)=(take_a @ (size_size_list_a @ xs) @ ys))&((f)=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 1.04/1.26 thf(fact_54_Ex__list__of__length, axiom, ![X5:nat]:(?[X47:list_a]:(((size_size_list_a @ X47)=(X5)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_54_Ex__list__of__length)). 1.04/1.26 thf(fact_104_drop__all__iff, axiom, ![X5:nat, X1:list_a]:((((drop_a @ X5 @ X1)=(nil_a))<=>(ord_less_eq_nat @ (size_size_list_a @ X1) @ X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_104_drop__all__iff)). 1.04/1.26 thf(fact_221_drop__Nil, axiom, ![X5:nat]:(((drop_a @ X5 @ nil_a)=(nil_a))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_221_drop__Nil)). 1.04/1.26 thf(conj_0, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 1.04/1.26 thf(fact_86_i__append__assoc, axiom, ![X1:list_a, X4:list_a, X2:nat > a]:(((listIn1312259492pend_a @ X1 @ (listIn1312259492pend_a @ X4 @ X2))=(listIn1312259492pend_a @ (append_a @ X1 @ X4) @ X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_86_i__append__assoc)). 1.04/1.26 thf(fact_15_length__drop, axiom, ![X5:nat, X1:list_a]:(((size_size_list_a @ (drop_a @ X5 @ X1))=(minus_minus_nat @ (size_size_list_a @ X1) @ X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_15_length__drop)). 1.04/1.26 thf(fact_215_append__Nil, axiom, ![X4:list_a]:(((append_a @ nil_a @ X4)=(X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_215_append__Nil)). 1.04/1.26 thf(fact_95_i__append__eq__i__append__conv2__aux, axiom, ![X1:list_a, X2:nat > a, X4:list_a, X3:nat > a]:((((listIn1312259492pend_a @ X1 @ X2)=(listIn1312259492pend_a @ X4 @ X3))=>((ord_less_eq_nat @ (size_size_list_a @ X1) @ (size_size_list_a @ X4))=>?[X67:list_a]:((((append_a @ X1 @ X67)=(X4))&((X2)=(listIn1312259492pend_a @ X67 @ X3))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_95_i__append__eq__i__append__conv2__aux)). 1.04/1.26 thf(fact_115_length__greater__imp__not__empty, axiom, ![X5:nat, X1:list_a]:(((ord_less_nat @ X5 @ (size_size_list_a @ X1))=>((X1)!=(nil_a)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_115_length__greater__imp__not__empty)). 1.04/1.26 thf(fact_126_neqE, axiom, ![X6:nat, X33:nat]:((((X6)!=(X33))=>(~((ord_less_nat @ X6 @ X33))=>(ord_less_nat @ X33 @ X6)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_126_neqE)). 1.04/1.26 thf(fact_6_list__take__drop__imp__eq, axiom, ![X5:nat, X1:list_a, X4:list_a]:((((take_a @ X5 @ X1)=(take_a @ X5 @ X4))=>(((drop_a @ X5 @ X1)=(drop_a @ X5 @ X4))=>((X1)=(X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_6_list__take__drop__imp__eq)). 1.04/1.26 thf(fact_27_drop__take, axiom, ![X5:nat, X13:nat, X1:list_a]:(((drop_a @ X5 @ (take_a @ X13 @ X1))=(take_a @ (minus_minus_nat @ X13 @ X5) @ (drop_a @ X5 @ X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_27_drop__take)). 1.04/1.26 thf(fact_116_drop__not__empty__conv, axiom, ![X5:nat, X1:list_a]:((((drop_a @ X5 @ X1)!=(nil_a))<=>(ord_less_nat @ X5 @ (size_size_list_a @ X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_116_drop__not__empty__conv)). 1.04/1.26 thf(fact_87_append__take__drop__id, axiom, ![X5:nat, X1:list_a]:(((append_a @ (take_a @ X5 @ X1) @ (drop_a @ X5 @ X1))=(X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_87_append__take__drop__id)). 1.04/1.26 thf(fact_25_i__append__eq__conv__conj, axiom, ![X1:list_a, X2:nat > a, X3:nat > a]:((((listIn1312259492pend_a @ X1 @ X2)=(X3))<=>(((X1)=(listIn84854903take_a @ (size_size_list_a @ X1) @ X3))&((X2)=(listIn1417627087drop_a @ (size_size_list_a @ X1) @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_25_i__append__eq__conv__conj)). 1.04/1.26 thf(fact_17_i__append__i__drop, axiom, ![X5:nat, X1:list_a, X2:nat > a]:(((listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2))=(listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ (listIn1417627087drop_a @ (minus_minus_nat @ X5 @ (size_size_list_a @ X1)) @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_17_i__append__i__drop)). 1.04/1.26 thf(fact_113_i__append__Nil, axiom, ![X2:nat > a]:(((listIn1312259492pend_a @ nil_a @ X2)=(X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_113_i__append__Nil)). 1.04/1.26 thf(fact_8_i__append__i__drop__eq1, axiom, ![X5:nat, X1:list_a, X2:nat > a]:(((ord_less_eq_nat @ X5 @ (size_size_list_a @ X1))=>((listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2))=(listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_8_i__append__i__drop__eq1)). 1.04/1.26 thf(fact_5_order__refl, axiom, ![X6:nat]:((ord_less_eq_nat @ X6 @ X6)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_5_order__refl)). 1.04/1.26 thf(c_0_23, plain, ![X988:list_a, X989:list_a, X990:list_a]:((((((X988)=(take_a @ (size_size_list_a @ X988) @ X990))|((append_a @ X988 @ X989)!=(X990)))&(((X989)=(drop_a @ (size_size_list_a @ X988) @ X990))|((append_a @ X988 @ X989)!=(X990))))&(((X988)!=(take_a @ (size_size_list_a @ X988) @ X990))|((X989)!=(drop_a @ (size_size_list_a @ X988) @ X990))|((append_a @ X988 @ X989)=(X990))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_96_append__eq__conv__conj])])])). 1.04/1.26 thf(c_0_24, plain, ![X68:list_a, X69:list_a, X70:list_a, X71:list_a]:((((append_a @ X68 @ X69)=(append_a @ X70 @ X71))<=>(((ord_less_eq_nat @ (size_size_list_a @ X68) @ (size_size_list_a @ X70))=>(((X68)=(take_a @ (size_size_list_a @ X68) @ X70))&((X69)=(append_a @ (drop_a @ (size_size_list_a @ X68) @ X70) @ X71))))&(~(ord_less_eq_nat @ (size_size_list_a @ X68) @ (size_size_list_a @ X70))=>(((take_a @ (size_size_list_a @ X70) @ X68)=(X70))&((append_a @ (drop_a @ (size_size_list_a @ X70) @ X68) @ X69)=(X71))))))), inference(fof_simplification,[status(thm)],[fact_98_append__eq__append__conv__if])). 1.04/1.26 thf(c_0_25, plain, ![X1:list_a, X4:list_a, X7:list_a]:((((X1)=(drop_a @ (size_size_list_a @ X4) @ X7))|((append_a @ X4 @ X1)!=(X7)))), inference(split_conjunct,[status(thm)],[c_0_23])). 1.04/1.26 thf(c_0_26, plain, ![X1285:list_a]:(((append_a @ X1285 @ nil_a)=(X1285))), inference(variable_rename,[status(thm)],[fact_105_append__Nil2])). 1.04/1.26 thf(c_0_27, plain, ![X991:list_a, X992:list_a, X993:list_a, X994:list_a]:(((((((X991)=(take_a @ (size_size_list_a @ X991) @ X993))|~(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)!=(append_a @ X993 @ X994)))&(((X992)=(append_a @ (drop_a @ (size_size_list_a @ X991) @ X993) @ X994))|~(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)!=(append_a @ X993 @ X994))))&((((take_a @ (size_size_list_a @ X993) @ X991)=(X993))|(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)!=(append_a @ X993 @ X994)))&(((append_a @ (drop_a @ (size_size_list_a @ X993) @ X991) @ X992)=(X994))|(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)!=(append_a @ X993 @ X994)))))&(((~(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)=(append_a @ X993 @ X994)))&(((take_a @ (size_size_list_a @ X993) @ X991)!=(X993))|((append_a @ (drop_a @ (size_size_list_a @ X993) @ X991) @ X992)!=(X994))|(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|((append_a @ X991 @ X992)=(append_a @ X993 @ X994))))&((~(ord_less_eq_nat @ (size_size_list_a @ X991) @ (size_size_list_a @ X993))|(((X991)!=(take_a @ (size_size_list_a @ X991) @ X993))|((X992)!=(append_a @ (drop_a @ (size_size_list_a @ X991) @ X993) @ X994)))|((append_a @ X991 @ X992)=(append_a @ X993 @ X994)))&(((take_a @ (size_size_list_a @ X993) @ X991)!=(X993))|((append_a @ (drop_a @ (size_size_list_a @ X993) @ X991) @ X992)!=(X994))|(((X991)!=(take_a @ (size_size_list_a @ X991) @ X993))|((X992)!=(append_a @ (drop_a @ (size_size_list_a @ X991) @ X993) @ X994)))|((append_a @ X991 @ X992)=(append_a @ X993 @ X994))))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])). 1.04/1.26 thf(c_0_28, negated_conjecture, ~((((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g))<=>(((xs)=(take_a @ (size_size_list_a @ xs) @ ys))&((f)=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g))))), inference(assume_negation,[status(cth)],[conj_1])). 1.04/1.26 thf(c_0_29, plain, ![X1:list_a, X4:list_a]:(((drop_a @ (size_size_list_a @ X1) @ (append_a @ X1 @ X4))=(X4))), inference(er,[status(thm)],[c_0_25])). 1.04/1.26 thf(c_0_30, plain, ![X1:list_a]:(((append_a @ X1 @ nil_a)=(X1))), inference(split_conjunct,[status(thm)],[c_0_26])). 1.04/1.26 thf(c_0_31, plain, ![X963:nat]:(((size_size_list_a @ (esk25_1 @ X963))=(X963))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fact_54_Ex__list__of__length])])). 1.04/1.26 thf(c_0_32, plain, ![X1009:nat, X1010:list_a]:(((((drop_a @ X1009 @ X1010)!=(nil_a))|(ord_less_eq_nat @ (size_size_list_a @ X1010) @ X1009))&(~(ord_less_eq_nat @ (size_size_list_a @ X1010) @ X1009)|((drop_a @ X1009 @ X1010)=(nil_a))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_104_drop__all__iff])])). 1.04/1.26 thf(c_0_33, plain, ![X1079:nat]:(((drop_a @ X1079 @ nil_a)=(nil_a))), inference(variable_rename,[status(thm)],[fact_221_drop__Nil])). 1.04/1.26 thf(c_0_34, plain, ![X1:list_a, X4:list_a, X7:list_a, X8:list_a]:((((X1)=(take_a @ (size_size_list_a @ X1) @ X4))|~((ord_less_eq_nat @ (size_size_list_a @ X1) @ (size_size_list_a @ X4)))|((append_a @ X1 @ X7)!=(append_a @ X4 @ X8)))), inference(split_conjunct,[status(thm)],[c_0_27])). 1.04/1.26 thf(c_0_35, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), inference(split_conjunct,[status(thm)],[conj_0])). 1.04/1.26 thf(c_0_36, plain, ![X1038:list_a, X1039:list_a, X1040:nat > a]:(((listIn1312259492pend_a @ X1038 @ (listIn1312259492pend_a @ X1039 @ X1040))=(listIn1312259492pend_a @ (append_a @ X1038 @ X1039) @ X1040))), inference(variable_rename,[status(thm)],[fact_86_i__append__assoc])). 1.04/1.26 thf(c_0_37, negated_conjecture, ((((listIn1312259492pend_a @ xs @ f)!=(listIn1312259492pend_a @ ys @ g))|(((xs)!=(take_a @ (size_size_list_a @ xs) @ ys))|((f)!=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g))))&((((xs)=(take_a @ (size_size_list_a @ xs) @ ys))|((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g)))&(((f)=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g))|((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])). 1.04/1.26 thf(c_0_38, plain, ![X950:nat, X951:list_a]:(((size_size_list_a @ (drop_a @ X950 @ X951))=(minus_minus_nat @ (size_size_list_a @ X951) @ X950))), inference(variable_rename,[status(thm)],[fact_15_length__drop])). 1.04/1.26 thf(c_0_39, plain, ![X1:list_a]:(((drop_a @ (size_size_list_a @ X1) @ X1)=(nil_a))), inference(spm,[status(thm)],[c_0_29, c_0_30])). 1.04/1.26 thf(c_0_40, plain, ![X5:nat]:(((size_size_list_a @ (esk25_1 @ X5))=(X5))), inference(split_conjunct,[status(thm)],[c_0_31])). 1.04/1.26 thf(c_0_41, plain, ![X5:nat, X1:list_a]:(((ord_less_eq_nat @ (size_size_list_a @ X1) @ X5)|((drop_a @ X5 @ X1)!=(nil_a)))), inference(split_conjunct,[status(thm)],[c_0_32])). 1.04/1.26 thf(c_0_42, plain, ![X5:nat]:(((drop_a @ X5 @ nil_a)=(nil_a))), inference(split_conjunct,[status(thm)],[c_0_33])). 1.04/1.26 thf(c_0_43, plain, ![X1301:list_a]:(((append_a @ nil_a @ X1301)=(X1301))), inference(variable_rename,[status(thm)],[fact_215_append__Nil])). 1.04/1.26 thf(c_0_44, hypothesis, ![X1:list_a, X4:list_a]:((((take_a @ (size_size_list_a @ xs) @ ys)=(xs))|((append_a @ xs @ X1)!=(append_a @ ys @ X4)))), inference(spm,[status(thm)],[c_0_34, c_0_35])). 1.04/1.26 thf(c_0_45, plain, ![X983:list_a, X984:nat > a, X985:list_a, X986:nat > a]:(((((append_a @ X983 @ (esk26_4 @ X983 @ X984 @ X985 @ X986))=(X985))|~(ord_less_eq_nat @ (size_size_list_a @ X983) @ (size_size_list_a @ X985))|((listIn1312259492pend_a @ X983 @ X984)!=(listIn1312259492pend_a @ X985 @ X986)))&(((X984)=(listIn1312259492pend_a @ (esk26_4 @ X983 @ X984 @ X985 @ X986) @ X986))|~(ord_less_eq_nat @ (size_size_list_a @ X983) @ (size_size_list_a @ X985))|((listIn1312259492pend_a @ X983 @ X984)!=(listIn1312259492pend_a @ X985 @ X986))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_95_i__append__eq__i__append__conv2__aux])])])])). 1.04/1.26 thf(c_0_46, plain, ![X1:list_a, X4:list_a, X2:nat > a]:(((listIn1312259492pend_a @ X1 @ (listIn1312259492pend_a @ X4 @ X2))=(listIn1312259492pend_a @ (append_a @ X1 @ X4) @ X2))), inference(split_conjunct,[status(thm)],[c_0_36])). 1.04/1.26 thf(c_0_47, negated_conjecture, (((f)=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g))|((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g))), inference(split_conjunct,[status(thm)],[c_0_37])). 1.04/1.26 thf(c_0_48, plain, ![X1:list_a, X7:list_a, X4:list_a]:((((append_a @ X1 @ X7)=(X4))|((X1)!=(take_a @ (size_size_list_a @ X1) @ X4))|((X7)!=(drop_a @ (size_size_list_a @ X1) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_23])). 1.04/1.26 thf(c_0_49, plain, ![X1013:nat, X1014:list_a]:((~(ord_less_nat @ X1013 @ (size_size_list_a @ X1014))|((X1014)!=(nil_a)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_115_length__greater__imp__not__empty])])). 1.04/1.26 thf(c_0_50, plain, ![X6:nat, X33:nat]:((((X6)!=(X33))=>(~(ord_less_nat @ X6 @ X33)=>(ord_less_nat @ X33 @ X6)))), inference(fof_simplification,[status(thm)],[fact_126_neqE])). 1.04/1.26 thf(c_0_51, plain, ![X1061:nat, X1062:list_a, X1063:list_a]:((((take_a @ X1061 @ X1062)!=(take_a @ X1061 @ X1063))|(((drop_a @ X1061 @ X1062)!=(drop_a @ X1061 @ X1063))|((X1062)=(X1063))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_6_list__take__drop__imp__eq])])). 1.04/1.26 thf(c_0_52, plain, ![X1067:nat, X1068:nat, X1069:list_a]:(((drop_a @ X1067 @ (take_a @ X1068 @ X1069))=(take_a @ (minus_minus_nat @ X1068 @ X1067) @ (drop_a @ X1067 @ X1069)))), inference(variable_rename,[status(thm)],[fact_27_drop__take])). 1.04/1.26 thf(c_0_53, plain, ![X1:list_a, X5:nat]:(((size_size_list_a @ (drop_a @ X5 @ X1))=(minus_minus_nat @ (size_size_list_a @ X1) @ X5))), inference(split_conjunct,[status(thm)],[c_0_38])). 1.04/1.26 thf(c_0_54, plain, ![X5:nat]:(((drop_a @ X5 @ (esk25_1 @ X5))=(nil_a))), inference(spm,[status(thm)],[c_0_39, c_0_40])). 1.04/1.26 thf(c_0_55, plain, ![X5:nat]:((ord_less_eq_nat @ (size_size_list_a @ nil_a) @ X5)), inference(spm,[status(thm)],[c_0_41, c_0_42])). 1.04/1.26 thf(c_0_56, plain, ![X1:list_a]:(((append_a @ nil_a @ X1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_43])). 1.04/1.26 thf(c_0_57, hypothesis, ![X1:list_a]:((((take_a @ (size_size_list_a @ xs) @ ys)=(xs))|((append_a @ xs @ X1)!=(ys)))), inference(spm,[status(thm)],[c_0_44, c_0_30])). 1.04/1.26 thf(c_0_58, plain, ![X1:list_a, X2:nat > a, X4:list_a, X3:nat > a]:((((append_a @ X1 @ (esk26_4 @ X1 @ X2 @ X4 @ X3))=(X4))|~((ord_less_eq_nat @ (size_size_list_a @ X1) @ (size_size_list_a @ X4)))|((listIn1312259492pend_a @ X1 @ X2)!=(listIn1312259492pend_a @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_45])). 1.04/1.26 thf(c_0_59, negated_conjecture, ![X1:list_a]:((((listIn1312259492pend_a @ (append_a @ X1 @ (drop_a @ (size_size_list_a @ xs) @ ys)) @ g)=(listIn1312259492pend_a @ X1 @ f))|((listIn1312259492pend_a @ ys @ g)=(listIn1312259492pend_a @ xs @ f)))), inference(spm,[status(thm)],[c_0_46, c_0_47])). 1.04/1.26 thf(c_0_60, plain, ![X4:list_a, X1:list_a]:((((append_a @ X1 @ (drop_a @ (size_size_list_a @ X1) @ X4))=(X4))|((take_a @ (size_size_list_a @ X1) @ X4)!=(X1)))), inference(er,[status(thm)],[c_0_48])). 1.04/1.26 thf(c_0_61, negated_conjecture, (((xs)=(take_a @ (size_size_list_a @ xs) @ ys))|((listIn1312259492pend_a @ xs @ f)=(listIn1312259492pend_a @ ys @ g))), inference(split_conjunct,[status(thm)],[c_0_37])). 1.04/1.26 thf(c_0_62, plain, ![X1015:nat, X1016:list_a]:(((((drop_a @ X1015 @ X1016)=(nil_a))|(ord_less_nat @ X1015 @ (size_size_list_a @ X1016)))&(~(ord_less_nat @ X1015 @ (size_size_list_a @ X1016))|((drop_a @ X1015 @ X1016)!=(nil_a))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_116_drop__not__empty__conv])])). 1.04/1.26 thf(c_0_63, plain, ![X5:nat, X1:list_a]:((~((ord_less_nat @ X5 @ (size_size_list_a @ X1)))|((X1)!=(nil_a)))), inference(split_conjunct,[status(thm)],[c_0_49])). 1.04/1.26 thf(c_0_64, plain, ![X1166:nat, X1167:nat]:((((X1166)=(X1167))|((ord_less_nat @ X1166 @ X1167)|(ord_less_nat @ X1167 @ X1166)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])). 1.04/1.26 thf(c_0_65, plain, ![X1070:nat, X1071:list_a]:(((append_a @ (take_a @ X1070 @ X1071) @ (drop_a @ X1070 @ X1071))=(X1071))), inference(variable_rename,[status(thm)],[fact_87_append__take__drop__id])). 1.04/1.26 thf(c_0_66, plain, ![X1:list_a, X5:nat, X4:list_a]:((((X1)=(X4))|((take_a @ X5 @ X1)!=(take_a @ X5 @ X4))|((drop_a @ X5 @ X1)!=(drop_a @ X5 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_51])). 1.04/1.26 thf(c_0_67, plain, ![X1:list_a, X5:nat]:((((drop_a @ X5 @ X1)=(nil_a))|~((ord_less_eq_nat @ (size_size_list_a @ X1) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_32])). 1.04/1.26 thf(c_0_68, plain, ![X6:nat, X5:nat, X1:list_a]:(((drop_a @ X5 @ (take_a @ X6 @ X1))=(take_a @ (minus_minus_nat @ X6 @ X5) @ (drop_a @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_52])). 1.04/1.26 thf(c_0_69, plain, ![X5:nat]:(((minus_minus_nat @ X5 @ X5)=(size_size_list_a @ nil_a))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_40])). 1.04/1.26 thf(c_0_70, plain, ![X1:list_a]:(((take_a @ (size_size_list_a @ nil_a) @ X1)=(nil_a))), inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_55]), c_0_56])])). 1.04/1.26 thf(c_0_71, hypothesis, ![X2:nat > a, X3:nat > a]:((((take_a @ (size_size_list_a @ xs) @ ys)=(xs))|((listIn1312259492pend_a @ xs @ X2)!=(listIn1312259492pend_a @ ys @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_58])]), c_0_35])])). 1.04/1.26 thf(c_0_72, negated_conjecture, ((listIn1312259492pend_a @ ys @ g)=(listIn1312259492pend_a @ xs @ f)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_60]), c_0_61])). 1.04/1.26 thf(c_0_73, plain, ![X5:nat, X1:list_a]:((~((ord_less_nat @ X5 @ (size_size_list_a @ X1)))|((drop_a @ X5 @ X1)!=(nil_a)))), inference(split_conjunct,[status(thm)],[c_0_62])). 1.04/1.26 thf(c_0_74, plain, ![X5:nat]:(~((ord_less_nat @ X5 @ (size_size_list_a @ nil_a)))), inference(er,[status(thm)],[c_0_63])). 1.04/1.26 thf(c_0_75, plain, ![X6:nat, X5:nat]:((((X5)=(X6))|(ord_less_nat @ X5 @ X6)|(ord_less_nat @ X6 @ X5))), inference(split_conjunct,[status(thm)],[c_0_64])). 1.04/1.26 thf(c_0_76, plain, ![X5:nat, X1:list_a]:(((append_a @ (take_a @ X5 @ X1) @ (drop_a @ X5 @ X1))=(X1))), inference(split_conjunct,[status(thm)],[c_0_65])). 1.04/1.26 thf(c_0_77, plain, ![X1:list_a, X4:list_a, X5:nat]:((((X1)=(X4))|((take_a @ X5 @ X1)!=(take_a @ X5 @ X4))|((drop_a @ X5 @ X1)!=(nil_a))|~((ord_less_eq_nat @ (size_size_list_a @ X4) @ X5)))), inference(spm,[status(thm)],[c_0_66, c_0_67])). 1.04/1.26 thf(c_0_78, plain, ![X5:nat, X1:list_a]:(((drop_a @ X5 @ (take_a @ X5 @ X1))=(nil_a))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68, c_0_69]), c_0_70])). 1.04/1.26 thf(c_0_79, negated_conjecture, (((listIn1312259492pend_a @ xs @ f)!=(listIn1312259492pend_a @ ys @ g))|((xs)!=(take_a @ (size_size_list_a @ xs) @ ys))|((f)!=(listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g))), inference(split_conjunct,[status(thm)],[c_0_37])). 1.04/1.26 thf(c_0_80, negated_conjecture, ![X2:nat > a]:((((take_a @ (size_size_list_a @ xs) @ ys)=(xs))|((listIn1312259492pend_a @ xs @ X2)!=(listIn1312259492pend_a @ xs @ f)))), inference(spm,[status(thm)],[c_0_71, c_0_72])). 1.04/1.26 thf(c_0_81, plain, ![X1:list_a, X5:nat, X6:nat]:((((drop_a @ X5 @ (drop_a @ X6 @ X1))!=(nil_a))|~((ord_less_nat @ X5 @ (minus_minus_nat @ (size_size_list_a @ X1) @ X6))))), inference(spm,[status(thm)],[c_0_73, c_0_53])). 1.04/1.26 thf(c_0_82, plain, ![X5:nat]:((((size_size_list_a @ nil_a)=(X5))|(ord_less_nat @ (size_size_list_a @ nil_a) @ X5))), inference(spm,[status(thm)],[c_0_74, c_0_75])). 1.04/1.26 thf(c_0_83, plain, ![X1:list_a]:(((drop_a @ (size_size_list_a @ nil_a) @ X1)=(X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76, c_0_70]), c_0_56])). 1.04/1.26 thf(c_0_84, hypothesis, ![X1:list_a]:((((X1)=(xs))|((take_a @ (size_size_list_a @ ys) @ X1)!=(take_a @ (size_size_list_a @ ys) @ xs))|((drop_a @ (size_size_list_a @ ys) @ X1)!=(nil_a)))), inference(spm,[status(thm)],[c_0_77, c_0_35])). 1.04/1.26 thf(c_0_85, plain, ![X5:nat, X1:list_a]:(((take_a @ X5 @ (take_a @ X5 @ X1))=(take_a @ X5 @ X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76, c_0_78]), c_0_30])). 1.04/1.26 thf(c_0_86, plain, ![X955:list_a, X956:nat > a, X957:nat > a]:((((((X955)=(listIn84854903take_a @ (size_size_list_a @ X955) @ X957))|((listIn1312259492pend_a @ X955 @ X956)!=(X957)))&(((X956)=(listIn1417627087drop_a @ (size_size_list_a @ X955) @ X957))|((listIn1312259492pend_a @ X955 @ X956)!=(X957))))&(((X955)!=(listIn84854903take_a @ (size_size_list_a @ X955) @ X957))|((X956)!=(listIn1417627087drop_a @ (size_size_list_a @ X955) @ X957))|((listIn1312259492pend_a @ X955 @ X956)=(X957))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_25_i__append__eq__conv__conj])])])). 1.04/1.26 thf(c_0_87, negated_conjecture, (((listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g)!=(f))|((take_a @ (size_size_list_a @ xs) @ ys)!=(xs))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79, c_0_72])])). 1.04/1.26 thf(c_0_88, negated_conjecture, ((take_a @ (size_size_list_a @ xs) @ ys)=(xs)), inference(er,[status(thm)],[c_0_80])). 1.04/1.26 thf(c_0_89, plain, ![X952:nat, X953:list_a, X954:nat > a]:(((listIn1417627087drop_a @ X952 @ (listIn1312259492pend_a @ X953 @ X954))=(listIn1312259492pend_a @ (drop_a @ X952 @ X953) @ (listIn1417627087drop_a @ (minus_minus_nat @ X952 @ (size_size_list_a @ X953)) @ X954)))), inference(variable_rename,[status(thm)],[fact_17_i__append__i__drop])). 1.04/1.26 thf(c_0_90, plain, ![X5:nat, X1:list_a]:((((minus_minus_nat @ (size_size_list_a @ X1) @ X5)=(size_size_list_a @ nil_a))|((drop_a @ X5 @ X1)!=(nil_a)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_82]), c_0_83])). 1.04/1.26 thf(c_0_91, hypothesis, ![X1:list_a]:((((take_a @ (size_size_list_a @ ys) @ X1)=(xs))|((take_a @ (size_size_list_a @ ys) @ X1)!=(take_a @ (size_size_list_a @ ys) @ xs)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84, c_0_78]), c_0_85])). 1.04/1.26 thf(c_0_92, plain, ![X1:list_a, X2:nat > a, X3:nat > a]:((((X2)=(listIn1417627087drop_a @ (size_size_list_a @ X1) @ X3))|((listIn1312259492pend_a @ X1 @ X2)!=(X3)))), inference(split_conjunct,[status(thm)],[c_0_86])). 1.04/1.26 thf(c_0_93, plain, ![X1058:nat > a]:(((listIn1312259492pend_a @ nil_a @ X1058)=(X1058))), inference(variable_rename,[status(thm)],[fact_113_i__append__Nil])). 1.04/1.26 thf(c_0_94, negated_conjecture, ((listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g)!=(f)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87, c_0_88])])). 1.04/1.26 thf(c_0_95, plain, ![X1:list_a, X5:nat, X2:nat > a]:(((listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2))=(listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ (listIn1417627087drop_a @ (minus_minus_nat @ X5 @ (size_size_list_a @ X1)) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_89])). 1.04/1.26 thf(c_0_96, plain, ![X1:list_a, X5:nat]:(((minus_minus_nat @ (size_size_list_a @ (take_a @ X5 @ X1)) @ X5)=(size_size_list_a @ nil_a))), inference(spm,[status(thm)],[c_0_90, c_0_78])). 1.04/1.26 thf(c_0_97, hypothesis, ((take_a @ (size_size_list_a @ ys) @ xs)=(xs)), inference(er,[status(thm)],[c_0_91])). 1.04/1.26 thf(c_0_98, plain, ![X1:list_a, X2:nat > a]:(((listIn1417627087drop_a @ (size_size_list_a @ X1) @ (listIn1312259492pend_a @ X1 @ X2))=(X2))), inference(er,[status(thm)],[c_0_92])). 1.04/1.26 thf(c_0_99, plain, ![X2:nat > a]:(((listIn1312259492pend_a @ nil_a @ X2)=(X2))), inference(split_conjunct,[status(thm)],[c_0_93])). 1.04/1.26 thf(c_0_100, plain, ![X939:nat, X940:list_a, X941:nat > a]:((~(ord_less_eq_nat @ X939 @ (size_size_list_a @ X940))|((listIn1417627087drop_a @ X939 @ (listIn1312259492pend_a @ X940 @ X941))=(listIn1312259492pend_a @ (drop_a @ X939 @ X940) @ X941)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_i__append__i__drop__eq1])])). 1.04/1.26 thf(c_0_101, negated_conjecture, ((listIn1312259492pend_a @ (drop_a @ (size_size_list_a @ xs) @ ys) @ g @ esk225_0)!=(f @ esk225_0)), inference(neg_ext,[status(thm)],[c_0_94])). 1.04/1.26 thf(c_0_102, plain, ![X1:list_a, X2:nat > a, X5:nat, X6:nat]:(((listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ (listIn1417627087drop_a @ (minus_minus_nat @ X5 @ (size_size_list_a @ X1)) @ X2) @ X6)=(listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2) @ X6))), inference(arg_cong,[status(thm)],[c_0_95])). 1.04/1.26 thf(c_0_103, hypothesis, ((minus_minus_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys))=(size_size_list_a @ nil_a)), inference(spm,[status(thm)],[c_0_96, c_0_97])). 1.04/1.26 thf(c_0_104, plain, ![X2:nat > a]:(((listIn1417627087drop_a @ (size_size_list_a @ nil_a) @ X2)=(X2))), inference(spm,[status(thm)],[c_0_98, c_0_99])). 1.04/1.26 thf(c_0_105, plain, ![X5:nat, X2:nat > a, X1:list_a]:((((listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2))=(listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ X2))|~((ord_less_eq_nat @ X5 @ (size_size_list_a @ X1))))), inference(split_conjunct,[status(thm)],[c_0_100])). 1.04/1.26 thf(c_0_106, plain, ![X707:nat]:((ord_less_eq_nat @ X707 @ X707)), inference(variable_rename,[status(thm)],[fact_5_order__refl])). 1.04/1.26 thf(c_0_107, plain, ((listIn1417627087drop_a @ (size_size_list_a @ xs) @ (listIn1312259492pend_a @ xs @ f) @ esk225_0)!=(f @ esk225_0)), inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_101, c_0_102])])])]), c_0_103]), c_0_104])]), c_0_72])). 1.04/1.26 thf(c_0_108, plain, ![X6:nat, X5:nat, X2:nat > a, X1:list_a]:((((listIn1417627087drop_a @ X5 @ (listIn1312259492pend_a @ X1 @ X2) @ X6)=(listIn1312259492pend_a @ (drop_a @ X5 @ X1) @ X2 @ X6))|~((ord_less_eq_nat @ X5 @ (size_size_list_a @ X1))))), inference(arg_cong,[status(thm)],[c_0_105])). 1.04/1.26 thf(c_0_109, plain, ![X5:nat]:((ord_less_eq_nat @ X5 @ X5)), inference(split_conjunct,[status(thm)],[c_0_106])). 1.04/1.26 thf(c_0_110, plain, ![X2:nat > a, X5:nat]:(((listIn1312259492pend_a @ nil_a @ X2 @ X5)=(X2 @ X5))), inference(arg_cong,[status(thm)],[c_0_99])). 1.04/1.26 thf(c_0_111, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107, c_0_108]), c_0_39]), c_0_109])]), c_0_110]), ['proof']). 1.04/1.26 # SZS output end CNFRefutation 1.04/1.26 # Parsed axioms : 252 1.04/1.26 # Removed by relevancy pruning/SinE : 21 1.04/1.26 # Initial clauses : 388 1.04/1.26 # Removed in clause preprocessing : 18 1.04/1.26 # Initial clauses in saturation : 370 1.04/1.26 # Processed clauses : 4297 1.04/1.26 # ...of these trivial : 132 1.04/1.26 # ...subsumed : 2852 1.04/1.26 # ...remaining for further processing : 1313 1.04/1.26 # Other redundant clauses eliminated : 1317 1.04/1.26 # Clauses deleted for lack of memory : 0 1.04/1.26 # Backward-subsumed : 242 1.04/1.26 # Backward-rewritten : 111 1.04/1.26 # Generated clauses : 44321 1.04/1.26 # ...of the previous two non-redundant : 39691 1.04/1.26 # ...aggressively subsumed : 0 1.04/1.26 # Contextual simplify-reflections : 40 1.04/1.26 # Paramodulations : 42377 1.04/1.26 # Factorizations : 28 1.04/1.26 # NegExts : 186 1.04/1.26 # Equation resolutions : 1385 1.04/1.26 # Propositional unsat checks : 0 1.04/1.26 # Propositional check models : 0 1.04/1.26 # Propositional check unsatisfiable : 0 1.04/1.26 # Propositional clauses : 0 1.04/1.26 # Propositional clauses after purity: 0 1.04/1.26 # Propositional unsat core size : 0 1.04/1.26 # Propositional preprocessing time : 0.000 1.04/1.26 # Propositional encoding time : 0.000 1.04/1.26 # Propositional solver time : 0.000 1.04/1.26 # Success case prop preproc time : 0.000 1.04/1.26 # Success case prop encoding time : 0.000 1.04/1.26 # Success case prop solver time : 0.000 1.04/1.26 # Current number of processed clauses : 910 1.04/1.26 # Positive orientable unit clauses : 150 1.04/1.26 # Positive unorientable unit clauses: 13 1.04/1.26 # Negative unit clauses : 160 1.04/1.26 # Non-unit-clauses : 587 1.04/1.26 # Current number of unprocessed clauses: 35480 1.04/1.26 # ...number of literals in the above : 107303 1.04/1.26 # Current number of archived formulas : 0 1.04/1.26 # Current number of archived clauses : 354 1.04/1.26 # Clause-clause subsumption calls (NU) : 104983 1.04/1.26 # Rec. Clause-clause subsumption calls : 71323 1.04/1.26 # Non-unit clause-clause subsumptions : 1382 1.04/1.26 # Unit Clause-clause subsumption calls : 21012 1.04/1.26 # Rewrite failures with RHS unbound : 436 1.04/1.26 # BW rewrite match attempts : 3069 1.04/1.26 # BW rewrite match successes : 579 1.04/1.26 # Condensation attempts : 4297 1.04/1.26 # Condensation successes : 38 1.04/1.26 # Termbank termtop insertions : 1558069 1.04/1.26 1.04/1.26 # ------------------------------------------------- 1.04/1.26 # User time : 0.733 s 1.04/1.26 # System time : 0.027 s 1.04/1.26 # Total time : 0.760 s 1.04/1.26 # Maximum resident set size: 3468 pages 1.04/1.26 1.04/1.26 # ------------------------------------------------- 1.04/1.26 # User time : 0.742 s 1.04/1.26 # System time : 0.028 s 1.04/1.26 # Total time : 0.770 s 1.04/1.26 # Maximum resident set size: 1984 pages 1.04/1.26 EOF